Systems and methods for negotiating transactions between nodes

ABSTRACT

Distributed computing systems having mechanisms for efficiently coordinating transactions between nodes in the system are provided. One or more nodes may negotiate maximum time periods in which to communicate with each other or a transaction coordinator. A node is determined to be non-responsive when the time since a last communication exceeds the maximum time period. The maximum time period may include an adjustment for the latency of at least a portion of the distributed computing system.

This application is a divisional of and claims priority to U.S.application Ser. No. 10/007,060, filed Nov. 6, 2001 now U.S. Pat. No.6,976,074, which claims priority to provisional U.S. Application Ser.No. 60/329,796, filed on Oct. 16, 2001, the entire disclosures of whichare hereby incorporated by reference.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to the field of distributed computingsystems. More particularly, the invention provides methods and devicesfor coordinating transactions between nodes of a distributed computingsystem.

2. Description of Related Art

Distributed computing systems typically utilize transaction-processingmonitors to monitor the states of nodes of the system. Fixed “timeout”periods have been used by transaction-processing monitors to determinewhether or not nodes involved in a transaction are responsive ornon-responsive. In particular, if a node does not communicate with thetransaction-processing monitor for a period of time that exceeds thetimeout value, the node is considered non-responsive and a transactionmay be aborted.

Fixed timeout values limit the flexibility and the efficiency ofdistributed computing systems. For example, a set of nodes may desire tohave lengthy disconnection times to process data or perform otherfunctions, but must still respond within the fixed timeout period toavoid aborting a transaction. This is particularly a problem indisconnected computing environments in which a computer devicedisconnects form all communications infrastructure for a period of time.Computing systems that utilize fixed timeout values also do noteffectively address the wide variations in latency that can existbetween nodes.

Therefore, there exists a need in the art for systems and methods thatprovide increased flexibility with respect to determining theresponsiveness of the nodes of distributed computing systems.

BRIEF SUMMARY OF THE INVENTION

The present invention overcomes one or more of the limitations of theprior art by providing methods, systems and computer-executablecomponents for coordinating transactions between nodes in a distributedcomputing system. The nodes in the distributed computing system maynegotiate time contract values. A node is determined to benon-responsive when the node does not communicate with another node or atransaction coordinator within a predetermined time period identified inthe time contract. Allowing nodes to negotiate time contracts providesincreased flexibility and allows the nodes to optimize theirperformance.

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention is illustrated by way of example and not limitedin the accompanying figures in which like reference numerals indicatesimilar elements and in which:

FIG. 1 is a block diagram of a general-purpose computer system capableof being used in conjunction with the present invention;

FIG. 2 shows a distributed computing system including a transactioncoordinator, in accordance with an embodiment of the invention;

FIG. 3 illustrates a method of distributing information in a distributedcomputing system, in accordance with an embodiment of the invention;

FIG. 4 illustrates a peer-to-peer system for coordinating transactionsin a distributed computing system, in accordance with an embodiment ofthe invention; and

FIG. 5 illustrates a method of coordinating transaction in apeer-to-peer distributed computing system; in accordance with anembodiment of the invention;

DETAILED DESCRIPTION OF THE INVENTION

Aspects of the present invention may be implemented with computerdevices such as: personal computers, personal digital assistants,hand-held devices, multiprocessor systems, microprocessor-based orprogrammable consumer electronics, network PCS, minicomputers, mainframecomputers, and the like. In particular, two or more computer devices mayform nodes that conduct transactions in a distributed computing system.Although not required, the invention will be described in the generalcontext of computer-executable instructions, such as program modules,that are executed by computer devices. Generally, program modulesinclude routines, programs, objects, components, data structures, etc.,that perform particular tasks or implement particular abstract datatypes. In distributed computing systems, tasks may be performed byremote computer devices that are linked through a communicationsnetwork. In a distributed computing environment, program modules may belocated in both local and remote memory storage devices.

FIG. 1 is a schematic diagram of a conventional general-purpose digitalcomputing environment that can be used to implement various aspects ofthe invention. Computer 100 includes a processing unit 110, a systemmemory 120 and a system bus 130 that couples various system componentsincluding the system memory to the processing unit 110. System bus 130may be any of several types of bus structures including a memory bus ormemory controller, a peripheral bus, and a local bus using any of avariety of bus architectures. System memory 120 includes a read onlymemory (ROM) 140 and a random access memory (RAM) 150.

A basic input/output system (BIOS) 160 containing the basic routinesthat help to transfer information between elements within the computer100, such as during start-up, is stored in ROM 140. Computer 100 alsoincludes a hard disk drive 170 for reading from and writing to a harddisk (not shown), a magnetic disk drive 180 for reading from or writingto a removable magnetic disk 190, and an optical disk drive 191 forreading from or writing to a removable optical disk 192, such as a CDROM or other optical media. Hard disk drive 170, magnetic disk drive180, and optical disk drive 191 are respectively connected to the systembus 130 by a hard disk drive interface 192, a magnetic disk driveinterface 193, and an optical disk drive interface 194. The drives andtheir associated computer-readable media provide nonvolatile storage ofcomputer readable instructions, data structures, program modules andother data for personal computer 100. It will be appreciated by thoseskilled in the art that other types of computer readable media which canstore data that is accessible by a computer, such as magnetic cassettes,flash memory cards, digital video disks, Bernoulli cartridges, randomaccess memories (RAMs), read only memories (ROMs), and the like, mayalso be used in the exemplary operating environment.

A number of program modules can be stored on the hard disk, magneticdisk 190, optical disk 192, ROM 140 or RAM 150, including an operatingsystem 195, one or more application programs 196, other program modules197, and program data 198. A user can enter commands and informationinto computer 100 through input devices, such as a keyboard 101 and apointing device 102. Other input devices (not shown) may include amicrophone, joystick, game pad, satellite dish, scanner, or the like.These and other input devices are often connected to the processing unit110 through a serial port interface 106 that is coupled to the systembus, but may be connected by other interfaces, such as a parallel port,a game port, a universal serial bus (USB) or through a PCI board. Amonitor 107 or other type of display device is also connected to systembus 130 via an interface, such as a video adapter 108. In addition tothe monitor, personal computers typically include other peripheraloutput devices (not shown), such as speakers and printers.

Computer 100 can operate in a networked environment using logicalconnections to one or more remote computers, such as a remote computer109. Remote computer 109 can be a server, a router, a network PC, a peerdevice or other common network node, and typically includes many or allof the elements described above relative to computer 100, although onlya memory storage device 111 has been illustrated in FIG. 1. The logicalconnections depicted in FIG. 1 include a local area network (LAN) 112and a wide area network (WAN) 113. Such networking environments arecommonplace in offices, enterprise-wide computer networks, intranets andthe Internet.

When used in a LAN networking environment, computer 100 is connected tolocal network 112 through a network interface or adapter 114. When usedin a WAN networking environment, personal computer 100 typicallyincludes a modem 115 or other means for establishing a communicationsover wide area network 113, such as the Internet. Modem 115, which maybe internal or external, is connected to system bus 130 via serial portinterface 106. In a networked environment, program modules depictedrelative to personal computer 100, or portions thereof, may be stored inthe remote memory storage device.

It will be appreciated that the network connections shown are exemplaryand other ways of establishing a communications link between thecomputers can be used. The existence of any of various well-knownprotocols, such as TCP/IP, Ethernet, FTP, HTTP and the like, ispresumed, and the system can be operated in a client-serverconfiguration to permit a user to retrieve web pages from a web-basedserver. Any of various conventional web browsers can be used to displayand manipulate data on web pages.

FIG. 2 illustrates a distributed computing system in accordance with anembodiment of the invention. A group of nodes 202, 204 and 206 that areparticipants in a transaction communicate with a transaction coordinator208. One or more of nodes 202, 204 and 206 may be implemented with acomputer device, a routing device, a terminal, an application or anyother hardware or software component. In one aspect of the invention,nodes 202, 204 and 206 are components of a distributed computingenvironment. Moreover, all or some of nodes 202, 204 and 206 may beimplemented within a single computer device, routing device, terminal,application or other hardware or software component. Nodes 202, 204 and206 may be coupled to transaction coordinator 208 and/or to each othervia a variety of communication channels that may include a local areanetwork, a wide area network, a wireless network or a system bus.

Transaction coordinator 208 may include an interface module 210 forreceiving data and transmitting status messages to nodes 202, 204 and206. A time contract memory 212 may be used to store time contractvalues agreed upon between nodes coupled to transaction coordinator 208.A last contact memory 214 may store information identifying the lastcontact made by the nodes coupled to transaction coordinator 208. Acomparison module 216 may be utilized to determine the responsiveness ofnodes. In particular, comparison module 216 may utilize the last contactdata stored in last contact memory 214 and the current time to determineand elapsed time since the last contact from a particular node.Comparison module 216 may then compare the elapsed time value to a timecontract value stored in memory 212. When the elapsed time exceeds thetime contract value, comparison module 216 determines that theparticular node is non-responsive.

Transaction coordinator 208 may also include a Time-contract-generationmodule 218 that may be used to generate proposed time contracts.Exemplary methods of generating time contracts are described in detailbelow. In some embodiments of the invention, proposed time contractstake into account the latency of particular nodes. The latency between apair of nodes may be a function of several factors, one of which may bethe load conditions of the nodes. A network performance-monitoringmodule 220 may be included to monitor the performance of nodes orportions of networks. Time-contract-generation module 218 may utilizethe information obtained by network performance-monitoring module 220when generating proposed time contracts. For example, iftime-contract-generation module determines that a given node should beable to perform a task within 2 milliseconds and networkperformance-monitoring module 220 determines that the latency betweenthat node and another node is approximately one millisecond,time-contract-generation module 218 may propose a time contract of, forexample, three milliseconds.

FIG. 3 illustrates a method of transmitting data in a distributedcomputing system that may be used by a node in accordance with anembodiment of the invention. First, in step 302, a first node mayregister with the transaction coordinator. The registration step mayinclude identifying the first node and one or more other nodes that thefirst node desires to communicate with. Next, in step 304 the first nodemay transmit to transaction coordinator 208 a proposed time contractwith a second node. The proposed time contract may identify the maximumperiod of time that a network node may not communicate with transactioncoordinator 208 without being considered non-responsive.

In step 306, transaction coordinator 208 may approve or deny theproposed time contract. Transaction coordinator 208 may consult othernodes that will be involved in the transaction, consider latency dataproduced by network performance-monitoring module 220 or consider otherinformation, such as the past performance histories of nodes, whenmaking the determination. In one embodiment, transaction coordinator 208will deny all proposed time contracts that include time periods thatexceed the relevant latency data for the nodes that will be involved inthe transaction.

When a time contract is denied by transaction coordinator 208,transaction coordinator 208 may utilize time-contract-generation module218 to propose a new time contract. For example, when a proposed timecontract is denied because the time exceeds the latency time of one ofthe nodes, transaction coordinator 208 may generate a new proposed timecontract that takes into consideration the latency times of the nodesthat will be involved in the transaction.

Returning to FIG. 3, after the transaction coordinator denies a timecontract, the first node may next determine whether or not transactioncoordinator 208 proposed a new time contract in step 308. Transactioncoordinator 208 may transmit a proposed new time contract at the sametime as transmitting the denial. When no time contract is proposed bytransaction coordinator 208, the first node may transmit a new proposedtime contract to transaction coordinator 208 in step 304. Whentransaction coordinator 208 does propose a new time contract, in step310 the first node may determine whether the proposed time contract isacceptable. Of course, there are numerous factors that may be used bythe first node in determining whether or not the proposed new timecontract is acceptable. When the proposed new time contract is notacceptable, the first node may transmit a denial to transactioncoordinator 208 in step 312 and propose yet another time contract instep 304. Steps 312 and 304 may be combined into a single step. When theproposed new time contract is acceptable, the first node may transmit anapproval of the time contract to transaction coordinator 208 instep 314.

In step 316, the first node prepares to send data to the second node.This step may include sending a status information query to transactioncoordinator 208. Next, in step 318 the first node receives statusinformation from transaction coordinator 208. The status information mayinclude the status of the second node, e.g., whether the second node isresponsive. Based on the status information, the first node maydetermine whether the second node is responsive in step 320. When thesecond node is not responsive, the transaction may be aborted in step322. When it is determined that the second node is responsive, data maybe transmitted to the second node in step 324.

FIG. 3 shows a transaction that involves two nodes for illustrationpurposes only. One skilled in the art will appreciate that aspects ofthe present invention may be used in conjunction with transactions thatinvolve any number of nodes. In embodiments that involve transactionsbetween three or more nodes, the nodes and/or transaction coordinator208 may be configured to request and respond to processing delayinquires. For example, nodes 202, 204 and 206 (shown in FIG. 2) may beinvolved in a two-step transaction that involves node 206 transmittingdata to node 204 in a first step and then node 204 transmitting data tonode 202 in a second step. During the first step, node 202 may send aprocessing delay inquiry to node 204 or transaction coordinator 208.When the time period in the contract between node 204 and node 206 hasnot been exceeded, node 204 or transaction coordinator 208 may transmita message to node 202 indicating the remaining time that node 206 has torespond without exceeding the time period in the time contract.

The nodes involved in transactions may have more than one time contract.Each time contract may correspond to a different category oftransaction. For example, transactions that involve the sale andpurchase of stocks may have time contracts with relatively short timeperiods when compared to transactions that are deemed less timesensitive or important. Moreover, in alternative embodiments, one ormore of the functions performed by transaction coordinator 208 may beperformed by one of the nodes involved in the transaction.

Aspects of the present invention may also be implemented in peer-to-peerdistributed computing systems. FIG. 4 shows an embodiment in which nodes402–404 are arranged in a peer-to-peer configuration. Nodes 402–404contain memories 406–408 respectively, that may be used to store timecontract information. In particular, each of memories 406–408 maycontain the identification of other nodes, time contract values and thetime of last contact with each of the nodes. Memory 406, for example,includes information indicating that node 402 has a time contract withnode 403 and that the time contract value is four seconds. Furthermore,the last contact with node 403 occurred at 10:04:21. Each of nodes402–404 may utilize information stored in their respective memories todetermine the responsiveness of other nodes. In one embodiment, memories406–408 are implemented with nonvolatile devices so that the storedinformation is not lost when a node is restarted.

FIG. 5 illustrates a method of transmitting data between nodes that arearranged in a peer-to-peer configuration, in accordance with anembodiment of the invention. First, in step 502, a node may negotiate atime contract with the recipient node. This step may include sending,receiving and analyzing proposed contract values. Before transmittingdata, in step 504, the node identifies an elapsed time since the lastcontact from the recipient node. The elapsed time may be determined bysubtracting the time of last contact from the current time. For example,if the current time is 10:06:21, node 402 (shown in FIG. 4) maydetermine that the elapsed time since the last contact with node 403 istwo seconds. In some embodiments, it may be desirable to synchronize thecurrent time of each of the nodes involved in a transaction. The NetworkTime Protocol (NTP) or other mechanisms may be used to synchronize thecurrent time of each of the nodes.

In step 506, the elapsed time since the last contact is compared to thetime period in the time contract. In the example given above thatincludes node 402, the elapsed time of two seconds would be compared tothe time contract value of 4 seconds. Finally, when the elapsed timedoes not exceed the time period in the time contract, the node maytransmit the data to the recipient node in step 508.

The present invention has been described herein with reference tospecific exemplary embodiments thereof. It will be apparent to thoseskilled in the art, that a person understanding this invention mayconceive of changes or other embodiments or variations, which utilizethe principles of this invention without departing from the broaderspirit and scope of the invention as set forth in the appended claims.All are considered within the sphere, spirit, and scope of theinvention. The specification and drawings are, therefore, to be regardedin an illustrative rather than restrictive sense. Accordingly, it is notintended that the invention be limited except as may be necessary inview of the appended claims.

1. A method of transmitting data in a distributed computing system, the method comprising the steps of: (a) transmitting from a first node to a transaction coordinator a proposed time contract for at least one transaction with at least a second node; (b) receiving from the transaction coordinator status information indicating responsiveness of the second node; and (c) transmitting data from the first node to the second node when the status information indicates that the last communication from the second node to the transaction coordinator has occurred within a predetermined period of time, wherein the duration of the predetermined period of time is equal to the proposed time contract.
 2. A method of transmitting data in a distributed computing system, the method comprising the steps of: (a) transmitting from a first node to a transaction coordinator a proposed time contract for at least one transaction with at least a second node; (b) receiving from the transaction coordinator status information indicating responsiveness of the second node; and (c) transmitting data from the first node to the second node when the status information indicates that the last communication from the second node to the transaction coordinator has occurred within a predetermined period of time, wherein the predetermined period of time is equal to the proposed time contract plus a latency value determined by the transaction coordinator.
 3. The method of claim 1, further including the step of receiving an alternative proposed time contract from the transaction coordinator.
 4. The method of claim 3, further including the step of transmitting to the transaction coordinator an approval of the alternative proposed time contract.
 5. The method of claim 1, wherein the proposed time contract corresponds to a single transaction.
 6. The method of claim 3, wherein the second node comprises the transaction coordinator.
 7. The method of claim 1, wherein the at least a second node comprises the second node and a third node.
 8. A computer-readable medium containing computer-executable instructions for causing a first node to perform the steps comprising: (a) transmitting from a first node to a transaction coordinator a proposed time contract for at least one transaction with at least a second node; (b) receiving from the transaction coordinator status information indicating responsiveness of the second node; and (c) transmitting data from the first node to the second node when the status information indicates that the last communication from the second node to the transaction coordinator has occurred within a predetermined period of time, wherein the duration of the predetermined period of time is equal to the proposed time contract.
 9. A computer-readable medium containing computer-executable instructions for causing a first node to perform the steps comprising: (a) transmitting from a first node to a transaction coordinator a proposed time contract for at least one transaction with at least a second node; (b) receiving from the transaction coordinator status information indicating responsiveness of the second node; and (c) transmitting data from the first node to the second node when the status information indicates that the last communication from the second node to the transaction coordinator has occurred within a predetermined period of time, wherein the predetermined period of time is equal to the proposed time contract plus a latency value determined by the transaction coordinator.
 10. The computer-readable medium of claim 8, wherein the computer-executable instructions further include the step of: (d) receiving an alternative proposed time contract from the transaction coordinator.
 11. The computer-readable medium of claim 10, wherein the computer-executable instructions further include the step of: (e) transmitting to the transaction coordinator an approval of the alternative proposed time contract.
 12. The computer-readable medium of claim 8, wherein the proposed time contract corresponds to a single transaction.
 13. The computer-readable medium of claim 10, wherein the second node comprises the transaction coordinator.
 14. The computer-readable medium of claim 8, wherein the at least a second node comprises the second node and a third node.
 15. A method of transmitting data in a distributed computing system, the method comprising the steps of: (a) receiving at a transaction coordinator a proposed time contract from a first node for at least one transaction with at least a second node; (b) transmitting from the transaction coordinator status information indicating responsiveness of the second node; and (c) receiving data from the first node at the second node when the status information indicates that the last communication from the second node to the transaction coordinator has occurred within a predetermined period of time, wherein the duration of the predetermined period of time is equal to the proposed time contract.
 16. A method of transmitting data in a distributed computing system, the method comprising the steps of: (a) receiving at a transaction coordinator a proposed time contract from a first node for at least one transaction with at least a second node; (b) transmitting from the transaction coordinator status information indicating responsiveness of the second node; and (c) receiving data from the first node at the second node when the status information indicates that the last communication from the second node to the transaction coordinator has occurred within a predetermined period of time, wherein the duration of the predetermined period of time is equal to the proposed time contract plus a latency value determined by the transaction coordinator.
 17. The method of claim 15, further including the step of receiving an alternative proposed time contract from the transaction coordinator.
 18. The method of claim 15, wherein the second node comprises the transaction coordinator. 